The simplest nearest-neighbor spin systems on regular graphs: Time dynamics of the mean coverage function
نویسنده
چکیده
We establish a characterization of the class of the simplest nearest neighbor spin systems possessing the mean coverage function (mcf) that obeys a second order differential equation, and derive explicit expressions for the mcf’s of the above models. Based on these expressions, the problem of ergodicity of the models is studied and bounds for their spectral gaps are obtained.
منابع مشابه
New fingerprint of the entanglement on the thermodynamic properties
The realization that entanglement can affect macroscopic properties of bulk solid-state systems is a challenge in physics and Chemistry. Theoretical physicists often are considered the entanglement between nearest-neighbor (NN) spins and tried to find its characterizations in terms of macroscopic thermodynamics observables as magnetization and specific heat. Here, we focus on the entanglement b...
متن کاملاثر برهمکنشهای چهار اسپینی برروی سیمای فاز مدل هایزنبرگ J1-J2 پادفرومغناطیس اسپین 3/2 شبکه لانه زنبوری
In this study, the effect of four-spin exchanges between the nearest and next nearest neighbor spins of honeycomb lattice on the phase diagram of S=3/2 antiferomagnetic Heisenberg model is considered with two-spin exchanges between the nearest and next nearest neighbor spins. Firstly, the method is investigated with classical phase diagram. In classical phase diagram, in addition to Neel order,...
متن کاملSpin-polarized transport through a zigzag-edge graphene flake embedded between two armchair nanoribbons electrodes
We study the coherent spin-polarized transport through a zigzag-edge graphene flake (ZGF), using Hubbard model in the nearest neighbor approximation within the framework of the Green function’s technique and Landauer formalism. The system considered consists of electrode/ (ZGF)/electrode, in which the electrodes are chosen to be armchair nanoribbons. The study was performed for two types of ele...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کامل